An alternative approach to comprehensive Gröbner bases
نویسندگان
چکیده
منابع مشابه
An efficient method for computing comprehensive Gröbner bases
a r t i c l e i n f o a b s t r a c t A new approach is proposed for computing a comprehensive Gröb-ner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the power products whose coefficients vanish; this is achieved by partitioning the polynomial into two parts...
متن کاملA Gröbner Approach to Involutive Bases
Recently, Zharkov and Blinkov introduced the notion of involutive bases of polynomial ideals. This involutive approach has its origin in the theory of partial di erential equations and is a translation of results of Janet and Pommaret. In this paper we present a pure algebraic foundation of involutive bases of Pommaret type. In fact, they turn out to be generalized left Grobner bases of ideals...
متن کاملGröbner Bases: An Introduction
The method (theory plus algorithms) of Gröbner bases provides a uniform approach to solving a wide range of problems expressed in terms of sets of multivariate polynomials. x y 2y z z 0 y 2 x 2 z x z 0 z 2 y 2 x x 0 Example: kinematic equations of a robot. algebraic geometry, commutative algebra, polynomial ideal theory invariant theory automated geometrical theorem proving Groebner-Bases.nb 1
متن کاملMultiplicative Bases, Gröbner Bases, and Right Gröbner Bases
Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...
متن کاملComprehensive Gröbner Bases in a Java Computer Algebra System
We present an implementation of the algorithms for computing comprehensive Gröbner bases in a Java computer algebra system (JAS). Contrary to approaches to implement comprehensive Gröbner bases with minimal requirements to the computer algebra system, we aim to provide and utilize all necessary algebraic structures occurring in the algorithm. In the implementation of a condition we aim at the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2003
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(03)00098-1